|
|
|
| e-Pub |
Previous | 
Home
Section: New Software and Platforms
Software
Software
Mole/Cunf: unfolders for Petri Nets
Participant : Stefan Schwoon [correspondant] .
Mole computes, given a safe Petri net, a finite prefix of its unfolding. It is designed to be compatible with other tools, such as PEP and the Model-Checking Kit, which are using the resulting unfolding for reachability checking and other analyses. The tool Mole arose out of earlier work on Petri nets. Details on Mole can be found at http://www.lsv.ens-cachan.fr/~schwoon/tools/mole/ . Mole served as an experimentation platform for several of our papers in recent years, most recently [33] .
In the context of MExICo, we have created a new tool called Cunf [82] , which is able to handle contextual nets, i.e. Petri nets with read arcs [80] .While in principle every contextual net can be transformed into an equivalent Petri net and then unfolded using Mole, Cunf can take advantage of their special features to do the job faster and produce a smaller unfolding. Cunf has recently been extended with a verification component that takes advantage of these features; More details can be found at http://www.lsv.ens-cachan.fr/~rodrigue/tools/cunf/ . Moreover, Cunf has been integrated into the CosyVerif environment (see section 5.2.1 ). Cunf has also participated in the Model Checking Contest held at the Petri Nets conference in 2013 and 2014.
TOURS: Testing On Unfolded Reactive Systems
Participant : Hernán Ponce de León [correspondant] .
The MOLE - based testing tool TOURS [42] has been developed in 2014 with the help of intern Konstantinos Athanasiou, jointly supervised by Hernán Ponce de León and Stefan Schwoon of the MExICo team at LSV); it has served successfully to experiment the partial-order based testing methodology on a scalable benchmark example (elevator control).
COSMOS : a Statistical Model Checker for the Hybrid Automata Stochastic Logic
Participant : Benoît Barbot [correspondant] .
COSMOS is a statistical model checker for the Hybrid Automata Stochastic Logic (HASL). HASL employs Linear Hybrid Automata (LHA), a generalization of Deterministic Timed Automata (DTA), to describe accepting execution paths of a Discrete Event Stochastic Process (DESP), a class of stochastic models which includes, but is not limited to, Markov chains. As a result HASL verification turns out to be a unifying framework where sophisticated temporal reasoning is naturally blended with elaborate reward-based analysis. COSMOS takes as input a DESP (described in terms of a Generalized Stochastic Petri Net), an LHA and an expression Z representing the quantity to be estimated. It returns a confidence interval estimation of Z; recently, it has been equipped with functionalities for rare event analysis. COSMOS is written in C++ and is freely available to the research community.
Details on COSMOS can be found at http://www.lsv.ens-cachan.fr/~barbot/cosmos/